Analysis of the Hash Function – Modified Grøstl
نویسندگان
چکیده
Modified Grøstl mGrøstl hash function was recently proposed by the authors as an alternative of one of the five finalist of SHA-3 competition namely Grøstl-256. This research paper presents the detailed analysis of algorithm along with performance evaluation of mGrøstl in eBASH project. According to the analysis, paper points out that different performance can be gained by adapting different platform. References A. Menezes, P. Oorschot & S. Vanstone, 1997, Handbook of Applied Cryptography. CRC Press http://www. cacr. math. uwateroo. ca/hac/ E. Biham and R. Chen, "Near-collisions of SHA-0," in Advances in Cryptology—CRYPTO 2004, Lecture Notes in Computer Science, M. K. Franklin, Ed. Berlin,
منابع مشابه
Breaking the Even-Mansour Hash Function: Collision and Preimage Attacks on JH and Grøstl
The Even-Mansour structure and the chopMD mode are two widely-used strategies in hash function designs. They are adopted by many hash functions including two SHA-3 finalists, the JH hash function and the Grøstl hash function. The Even-Mansour structure combining the chopMD mode is supposed to enhance the security of hash functions against collision and preimage attacks, while our results show t...
متن کاملImproved (Pseudo) Preimage Attack and Second Preimage Attack on Round-Reduced Grostl Hash Function
The Grøstl hash function is one of the five finalists in the third round of SHA-3 competition hosted by NIST. In this paper, we propose some improved (pseudo) preimage attacks on the Grøstl hash function by using some techniques, such as subspace preimage attack and the guess-and-determine technique. We present the improved pseudo preimage attacks on 5-round Grøstl-256 hash function and 8-round...
متن کاملA pipelined implementation of the grØstl hash algorithm and the advanced encryption standard
Grøstl is a recently proposed cryptographic hash algorithm that has common structure and features with the Advanced Encryption Standard (AES). The objective of this paper is to present the design of a high speed joint implementation of Grøstl and AES with minimal resources using a pipelining method. The advantage of this implementation is that it efficiently provides both cryptographic hash fun...
متن کامل(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others (Extended Version)
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash function for both 256-bit and 512-bit versions, i.e., we need to choose the initial value in order to invert the hash function. Pseudo preimage attack on 5(out of 10...
متن کامل(Pseudo) Preimage Attack on Round-Reduced Grøstl Hash Function and Others
The Grøstl hash function is one of the 5 final round candidates of the SHA-3 competition hosted by NIST. In this paper, we study the preimage resistance of the Grøstl hash function. We propose pseudo preimage attacks on Grøstl hash function for both 256-bit and 512-bit versions, i.e., we need to choose the initial value in order to invert the hash function. Pseudo preimage attack on 5(out of 10...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012